An ILP for the metro-line crossing problem
نویسندگان
چکیده
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V,E) (e.g. the railroad network) and a set H of paths in G (e.g. the train lines), we want to draw the paths along the edges of G such that they cross each other as few times as possible. For aesthetic reasons we insist that the relative order of the paths that traverse a vertex does not change within the area occupied by the vertex. We prove that the problem, which is known to be NP-hard, can be rewritten as an integer linear program that finds the optimal solution for the problem. In the case when the order of the endpoints of the paths is fixed we prove that the problem can be solved in polynomial time. This improves a recent result by Bekos et al. (2007).
منابع مشابه
An Improved Algorithm for the Metro-line Crossing Minimization Problem
In the metro-line crossing minimization problem, we are given a plane graph G = (V,E) and a set L of simple paths (or lines) that cover G, that is, every edge e ∈ E belongs to at least one path in L. The problem is to draw all paths in L along the edges of G such that the number of crossings between paths is minimized. This crossing minimization problem arises, for example, when drawing metro m...
متن کاملOn Metro-Line Crossing Minimization
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V,E) so that the total number of crossings among pairs of paths is minimized. This problem arises when drawing metro maps, where the embedding of G depicts the structure of the underlying network, the nodes of G correspond to train stations, an edge connecting two nodes implies that the...
متن کاملLine Crossing Minimization on Metro Maps
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is minimized. This problem arises when drawing metro maps, where the embedding of G depicts the structure of the underlying network, the nodes of G correspond to train stations, an edge connecting two nodes implies that t...
متن کاملSimulation of Metro Train Fire in an Underground Station of Tehran Metro Line 7
In this research a fire scenario was simulated in one of the stations of the line 7 of Tehran's subway system. The Line 7 is under construction and the ventilation system is under design. Fire was set for a stopping metro train at the platform of the station. A 160 meter length eight-car metro train with the forth wagon on the fire was studied. The heat release rate is based on a quadratic f...
متن کاملMetro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases
Crossing minimization is one of the central problems in graph drawing. Recently, there has been an increased interest in the problem of minimizing crossings between paths in drawings of graphs. This is the metro-line crossing minimization problem (MLCM): Given an embedded graph and a set L of simple paths, called lines, order the lines on each edge so that the total number of crossings is minim...
متن کاملExact and fixed-parameter algorithms for metro-line crossing minimization problems
A metro-line crossing minimization problem is to draw multiple lines on an underlying graph that models stations and rail tracks so that the number of crossings of lines becomes minimum. It has several variations by adding restrictions on how lines are drawn. Among those, there is one with a restriction that line terminals have to be drawn at a verge of a station, and it is known to be NP-hard ...
متن کامل